Algorithms for Fair Leader Election Problem
نویسندگان
چکیده
The consensus problem in general and the fair leader election (FLE) problem in particular is one of the most important problem in distributed computing. In this paper we propose two algorithms for solving the FLE problem on an asynchronous shared memory system with their analysis. We tried to solve the problem with di erent requirements such as minimizing steps, and time complexities. Also we address the high-level de nition of safety in a protocol, and we suggest an algorithm that satis es this property.
منابع مشابه
Towards Fair Leader Election in Wireless Networks
In this paper we consider a leader election problem in ad-hoc single hop radio sensor network with an adversary. The aim of the adversary is to be chosen as a leader. In many scenarios it can be a staring point for performing other attacks and taking control over the whole network. In our paper we show that in typical and well-known algorithms it is not possible to avoid this threat, i.e. the a...
متن کاملLeader Election Algorithms in Torus and Hypercube Networks Comparisons and Survey
Leader failure is one of the most fundamental problems in distributed systems. This problem can be solved by Leader Election Algorithms (LEAs). These algorithms move the system from an initial state where all the nodes are in the same computation state into a new state where only one node is distinguished computationally (called leader) and all other nodes aware of this leader. This research ai...
متن کاملThe Asymmetric leader election algorithm: number of survivors near the end of the game
The following classical asymmetric leader election algorithm has obtained quite a bit of attention lately. Starting with n players, each one throws a coin, and the k of them which have thrown head (with probability q) go on, and the leader will be found amongst them, using the same strategy. Should nobody advance, will the party repeat the procedure. One of the most interesting parameter here i...
متن کاملSelf-stabilizing Leader Election in Networks of Finite-State Anonymous Agents
This paper considers the self-stabilizing leader-election problem in a model of interacting anonymous finite-state agents. Leader election is a fundamental problem in distributed systems; many distributed problems are easily solved with the help of a central coordinator. Selfstabilizing algorithms do not require initialization in order to operate correctly and can recover from transient faults ...
متن کاملPerformance analysis of Leader Election Algorithms in Mobile Ad hoc Networks
Leader election is an extensively studied problem in Ad hoc networks. In our study, we have implemented an extended idea of an existing leader election algorithm for energy saving to arbitrary topological changes. In this method, our focus is to reduce the number of leader election processes; to make it more energy efficient. Unlike the previous solutions, the algorithm proposes that each node ...
متن کامل